- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Stephen A. Cook
8 found
Order:
- The relative efficiency of propositional proof systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.
- Tag Systems and Lag Systems.Hao Wang, John Cocke, Marvin Minsky & Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):344-344.
- Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 24–30. [REVIEW]Stephen A. Cook - 1970 - Journal of Symbolic Logic 34 (4):657-657.
- Bečvář Jiří. Real-time and complexity problems in automata theory. English with Czech summary. Kybernetika , vol. 1 , pp. 475–498. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.
- Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Stephen A. Cook - 1970 - Journal of Symbolic Logic 34 (4):657-658.
- Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-657.
- Review: Jiri Becvar, Real-Time and Complexity Problems in Automata Theory. [REVIEW]Stephen A. Cook - 1971 - Journal of Symbolic Logic 36 (2):346-346.
- Review: Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-c9g8x uwo